A Deflation Procedure for Subspace Decomposition
نویسندگان
چکیده
منابع مشابه
Deflation in Krylov Subspace Methods and Distance to Uncontrollability
The task of extracting from a Krylov decomposition the approximation to an eigenpair that yields the smallest backward error can be phrased as finding the smallest perturbation which makes an associated matrix pair uncontrollable. Exploiting this relationship, we propose a new deflation criterion, which potentially admits earlier deflations than standard deflation criteria. Along these lines, a...
متن کاملOn the Convergence of GMRES with Invariant-Subspace Deflation
We consider the solution of large and sparse linear systems of equations by GMRES. Due to the appearance of unfavorable eigenvalues in the spectrum of the coefficient matrix, the convergence of GMRES may hamper. To overcome this, a deflated variant of GMRES can be used, which treats those unfavorable eigenvalues effectively. In the literature, several deflated GMRES variants are applied success...
متن کاملRamanujan subspace pursuit for signal periodic decomposition
The period estimation and periodic decomposition of a signal are the long-standing problems in the field of signal processing and biomolecular sequence analysis. To address such problems, we introduce the Ramanujan subspace pursuit (RSP) based on the Ramanujan subspace. As a greedy iterative algorithm, the RSP can uniquely decompose any signal into a sum of exactly periodic components, by selec...
متن کاملOrthogonal, exactly periodic subspace decomposition
The detection and estimation of machine vibration multiperiodic signals of unknown periods in white Gaussian noise is investigated. New estimates for the subsignals (signals making up the received signal) and their periods are derived using an orthogonal subspace decomposition approach. The concept of exactly periodic signals is introduced. This in turn simplifies and enhances the understanding...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2010
ISSN: 1053-587X
DOI: 10.1109/tsp.2009.2037353